Inferring origin–destination trip matrices with a decoupled GLS path flow estimator
نویسندگان
چکیده
Recently, path flow estimators (PFE) have been used for the estimation of origin–destination (O–D) matrices. This paper develops a formulation that incorporates a decoupled path flow estimator in a generalized least squares (GLS) framework. The approach seeks to solve a GLS problem that minimizes the sum of errors in traffic counts and O–D matrices based on an equilibrium assignment mapping derived exogenously from a K-shortest path ranking procedure. Solving the GLS–PFE inevitably involves non-invertible linear systems and non-negative constraints. A solution algorithm is designed to iteratively identify active constraints and solve linear systems by computing the pseudoinverse. A simplified version of this algorithm is further developed to improve its computational efficiency. The solution properties and computational efficiency of the two methods are tested and compared for small to mid-size networks. It is concluded that the simplified algorithm is efficient in solving the decoupled GLS–PFE problem for realistic size networks. 2004 Published by Elsevier Ltd.
منابع مشابه
Examining the Quality of Synthetic Origin–Destination Trip Table Estimated by Path Flow Estimator
Path flow estimator ~PFE! is a one-stage network observer proposed in the transportation literature to estimate path flows and path travel times from traffic counts in a transportation network. The estimated path flows can further be aggregated to obtain the origin–destination sO–Dd flows, which are usually required in many transportation applications. In this paper, we examine the capability o...
متن کاملA robust framework for the estimation of dynamic OD trip matrices for reliable traffic management
Origin-Destination (OD) trip matrices describe the patterns of traffic behavior across the network and play a key role as primary data input to many traffic models. OD matrices are a critical requirement, either in static or dynamic models for traffic assignment. However, OD matrices are not yet directly observable; thus, the current practice consists of adjusting an initial or a priori matrix ...
متن کاملA maximum entropy-least squares estimator for elastic origin- destination trip matrix estimation
It is well known that the origin-destination (O-D) flow table of a subnetwork is not only determined by trip generation and distribution, but also by traffic routing and diversion, due to the existence of internal-external, external-internal and externalexternal flows. This result indicates the variable nature of subnetwork O-D flows. This paper discusses an elastic O-D flow table estimation pr...
متن کاملThe Effect of Randomization on Constraint Based Estimation of Elevator Trip Origin-Destination Matrices
We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem, and study different deterministic and randomized algorithms to solve the problem. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. It can be defined as a directed network, where the nodes correspond to the stops on the t...
متن کاملStrategies for Selecting Additional Traffic Counts for Improving O-d Trip Table Estimation
Traditional traffic counting location (TCL) problem is to determine the number and locations of counting stations that would best cover the network for the purpose of estimating origin-destination (O-D) trip tables. It is well noted that the quality of the estimated O-D trip table depends on the estimation methods, an appropriate set of links with traffic counts, and the quality of the traffic ...
متن کامل